Speeding up Markov chains with deterministic jumps
نویسندگان
چکیده
منابع مشابه
Random Generation of Deterministic Acyclic Automata Using Markov Chains
In this article we propose an algorithm, based on Markov chain techniques, to generate random automata that are deterministic, accessible and acyclic. The distribution of the output approaches the uniform distribution on n-state such automata. We then show how to adapt this algorithm in order to generate minimal acyclic automata with n states almost uniformly.
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملPersistent random walks , variable length Markov chains and piecewise deterministic Markov processes ∗
A classical random walk (St, t ∈ N) is defined by St := t ∑ n=0 Xn, where (Xn) are i.i.d. When the increments (Xn)n∈N are a one-order Markov chain, a short memory is introduced in the dynamics of (St). This so-called “persistent” random walk is nolonger Markovian and, under suitable conditions, the rescaled process converges towards the integrated telegraph noise (ITN) as the time-scale and spa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability Theory and Related Fields
سال: 2020
ISSN: 0178-8051,1432-2064
DOI: 10.1007/s00440-020-01006-4